Using Convolutional Codes for Key Extraction in Physical Unclonable Functions

نویسندگان

  • Sven Müelich
  • Martin Bossert
چکیده

Physical Unclonable Functions (PUFs) exploit variations in the manufacturing process to derive bit sequences from integrated circuits, which can be used as secure cryptographic keys. Instead of storing the keys in an insecure, non-volatile memory, they can be reproduced when needed. Since the reproduced sequences are not stable due to physical reasons, error correction must be applied. Recently, convolutional codes were shown to be suitable for key reproduction in PUFs based on SRAM. This work shows how to further decrease the reconstruction failure probability and PUF implementation size using codes with larger memory length and decoding concepts such as soft-information

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Choice of Optimal Error-correcting Code for Physical Unclonable Functions

This thesis explores error-correcting codes which can be used in physical unclonable function (PUF) applications. We investigate linear block codes and concatenated codes, which are traditionally used with PUFs, and compare them to convolutional codes using the criteria of error correction capability, decoder hardware requirements, flexibility of code parameters, and code rate. The application ...

متن کامل

Error Correction for Physical Unclonable Functions Using Generalized Concatenated Codes

Physical Unclonable Functions can be used for secure key generation in cryptographic applications. It is explained how methods from coding theory must be applied in order to ensure reliable key regeneration. Based on previous work, we show ways how to obtain better results with respect to error probability and codeword length. Also, an example based on Generalized Concatenated codes is given, w...

متن کامل

Wyner-Ziv Coding for Physical Unclonable Functions and Biometric Secrecy Systems

Two constructive linear coding methods, previously proposed for the Wyner-Ziv problem, are developed to achieve all points of the key-leakage-storage regions of the generatedand chosen-secret models of biometric secrecy systems. The models also apply to physical unclonable functions that are realized by fine hardware variations. The linear coding is implemented by using nested polar codes and t...

متن کامل

Timing Attack Resilient Decoding Algorithms for Physical Unclonable Functions

This paper deals with the application of list decoding of Reed–Solomon codes to a concatenated code for key reproduction using Physical Unclonable Functions. The resulting codes achieve a higher error-correction performance at the same code rate than known schemes in this scenario. We also show that their decoding algorithms can be protected from side-channel attacks on the runtime both by mask...

متن کامل

On Error Correction for Physical Unclonable Functions

Physical Unclonable Functions evaluate manufacturing variations to generate secure cryptographic keys for embedded systems without secure key storage. It is explained how methods from coding theory are applied in order to ensure reliable key reproduction. We show how better results can be obtained using code classes and decoding principles not used for this scenario before. These methods are ex...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1704.01306  شماره 

صفحات  -

تاریخ انتشار 2017